Critical point approximation through exact regularization
نویسندگان
چکیده
منابع مشابه
Critical Point Approximation Through Exact Regularization
We present several iterative methods for finding the critical points and/or the minima of a functional which is essentially the difference between two convex functions. The underlying idea relies upon partial and exact regularization of the functional, which allows us to preserve the local feature in a large number of applications, as well as to obtain some convergence results. These methods ar...
متن کاملSome new exact critical-point amplitudes
The scaling properties of the free energy and some of universal amplitudes of a group of models belonging to the universality class of the quantum nonlinear sigma model and the O(n) quantum φ4 model in the limit n → ∞ as well as the quantum spherical model, with nearest-neighbor and long-range interactions (decreasing at long distances r as 1/rd+σ) is presented. For temperature driven phase tra...
متن کاملNonequilibrium transport through double quantum dots: exact results near a quantum critical point.
While violations of the Fermi liquid paradigm for metals are of great interest in various physical systems, quantum impurity models are among the few cases where exact theoretical results are available. Double quantum dots can provide an experimental realization of the 2 impurity Kondo model which exhibits a non-Fermi-liquid quantum critical point at a special value of its parameters. We presen...
متن کاملExact renormalization group equation for the Lifshitz critical point
An exact renormalization equation (ERGE) accounting for an anisotropic scaling is derived. The critical and tricritical Lifshitz points are then studied at leading order of the derivative expansion which is shown to involve two differential equations. The resulting estimates of the Lifshitz critical exponents compare well with the O ( ǫ2 ) calculations. In the case of the Lifshitz tricritical p...
متن کاملExact Regularization of Convex Programs
The regularization of a convex program is exact if all solutions of the regularized problem are also solutions of the original problem for all values of the regularization parameter below some positive threshold. For a general convex program, we show that the regularization is exact if and only if a certain selection problem has a Lagrange multiplier. Moreover, the regularization parameter thre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1988
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1988-0917822-3